Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups
نویسندگان
چکیده
Braid groups were first introduced by Emil Artin in 1925. First cryptosystem, using Braid groups as a platform was discovered by Anshel et al in 2001. After the publication of this paper several cryptosystems on Braid groups had been designed. In this paper we have proposed a tripartite authenticated key agreement protocol using conjugacy problem which works in a braid group. We have proved that our protocol meet the security attributes under the assumption that the Braid Decomposition Problem (BDP) and the Conjugacy Search Problem (CSP) are hard in braid group.
منابع مشابه
An Authenticated Key Agreement Protocol Using Conjugacy Problem in Braid Groups
In this paper we propose an authenticated key agreement, which works in a braid group. We prove that our protocol meet the security attributes under the assumption that the Conjugacy Search Problem (CSP) is hard in braid group.
متن کاملPotential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
The braid group with its conjugacy problem is one of the recent hot issues in cryptography. At CT-RSA 2001, Anshel, Anshel, Fisher, and Goldfeld proposed a commutator key agreement protocol (KAP) based on the braid groups and their colored Burau representation. Its security is based on the multiple simultaneous conjugacy problem (MSCP) plus a newly adopted key extractor. This article shows how ...
متن کاملA Practical Attack on a Certain Braid Group Based Shifted Conjugacy Authentication Protocol
In recent years, Artin’s braid groups have undergone intense scrutiny as a possible cryptographic platform, due mainly to the key-exchange protocols proposed in [1] and [12]. The security of both of these protocols relies on the difficulty of variants of the conjugacy search problem in braid groups, a well-studied problem (see [9], [6], [10]). More recently, Dehornoy has proposed a zero-knowled...
متن کاملLength-based conjugacy search in the Braid group
Anshel, et. al., introduced a new cryptographic protocol, the Commutator key agreement protocol, whose strength lies heavily on the difficulty of the generalized conjugacy problem in subgroups of the Braid group. A natural approach to this problem is by using a length-based method, with the length of the Garside normal form as a length function. Experiments show that this approach is far from b...
متن کاملImproving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups
There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method developed by the author and Nuno Franco, originally intended to solve the Conjugacy Search Problem in braid groups.
متن کامل